A Swarm-based Algorithm for Solving Economic Load Dispatch Problem
نویسندگان
چکیده
منابع مشابه
Particle Swarm Optimization for Solving Economic Load Dispatch Problem
This work deals with the optimization of power flow through interconnected system. The work deals with efficient and reliable evolutionary based approach to solve the economic load dispatch (ELD) with line flows and voltage constraints. The work employs PSO algorithm for ELD. PSO is a robust, stochastic computational technique based on movement and intelligence of swarm. The work introduces a c...
متن کاملSolving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique
Economic load dispatch (ELD) problem is a common task in the operational planning of a power system, which requires to be optimized. This paper presents an effective and reliable particle swarm optimization (PSO) technique for the economic load dispatch problem. The results have been demonstrated for ELD of standard 3-generator and 6-generator systems with and without consideration of transmiss...
متن کاملapplication of swarm-based optimization algorithms for solving dynamic economic load dispatch problem
dynamic economic load dispatch is one of the most important roles of power generation’s operation and control. it determines the optimal controls of production of generator units with predicted load demand over a certain period of time. economic dispatch at minimum production cost is one of the most important subjects in the power network’s operation, which is a complicated nonlinear constraine...
متن کاملAdaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem
Optimization problems in design engineering are complex by nature, often because of the involvement of critical objective functions accompanied by a number of rigid constraints associated with the products involved. One such problem is Economic Load Dispatch (ED) problem which focuses on the optimization of the fuel cost while satisfying some system constraints. Classical optimization algorithm...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2019
ISSN: 0975-8887
DOI: 10.5120/ijca2019919719